Random Walks Whose Concave Majorants Often Have Few Faces

نویسندگان

  • ZHIHUA QIAO
  • MICHAEL STEELE
چکیده

We construct a continuous distribution G such that the number of faces in the smallest concave majorant of the random walk with G-distributed summands will take on each natural number infinitely often with probability one. This investigation is motivated by the fact that the number of faces Fn of the concave majorant of the random walk at time n has the same distribution as the number of records Rn in the sequence of summands up to time n. Since Rn is almost surely asymptotic to log n, the construction shows that despite the equality of all of the one-dimensional marginals, the almost sure behaviors of the sequences {Rn} and {Fn} may be radically different.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Bohnenblust–Spitzer Algorithm and its Applications

The familiar bijections between the representations of permutations as words and as products of cycles have a natural class of “data driven” extensions that permit us to use purely combinatorial means to obtain precise probabilistic information about the geometry of random walks. In particular, we show that the algorithmic bijection of Bohnenblust and Spitzer can be used to obtain means, varian...

متن کامل

Shape and local growth for multidimensional branching random walks in random environment

We study branching random walks in random environment on the ddimensional square lattice, d ≥ 1. In this model, the environment has finite range dependence, and the population size cannot decrease. We prove limit theorems (laws of large numbers) for the set of lattice sites which are visited up to a large time as well as for the local size of the population. The limiting shape of this set is co...

متن کامل

Generalized (c, d)-Entropy and Aging Random Walks

Complex systems are often inherently non-ergodic and non-Markovian and Shannon entropy loses its applicability. Accelerating, path-dependent and aging random walks offer an intuitive picture for non-ergodic and non-Markovian systems. It was shown that the entropy of non-ergodic systems can still be derived from three of the Shannon–Khinchin axioms and by violating the fourth, the so-called comp...

متن کامل

Recurrence of Quadratic Differentials for Harmonic Measure

We consider random walks on the mapping class group that have finite first moment with respect to the word metric, whose support generates a non-elementary subgroup and contains a pseudo-Anosov map whose invariant Teichmüller geodesic is in the principal stratum of quadratic differentials. We show that a Teichmüller geodesic typical with respect to the harmonic measure for such random walks, is...

متن کامل

First Hitting times of Simple Random Walks on Graphs with Congestion Points

We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005